Solving Constraint Satisfaction Puzzles with Constraint Programming
نویسندگان
چکیده
Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase. The platform used was Mozart.
منابع مشابه
Solving Crossword Puzzles as Probabilistic Constraint Satisfaction
Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we describe a formal model of constraint satisf...
متن کاملPattern-Based Constraint Satisfaction and Logic Puzzles
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the"simplest"solution. Different ways of reasoning with the constraints are formalised by various families of"resolution rules", each of them carrying its own notion of simplicity. A large part of the book ...
متن کاملConstraint Satisfaction with Probabilistic Preferences on Variable Values Constraint Satisfaction with Probabilistic Preferences on Variable Values
Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we provide a formal model of constraint satisfa...
متن کاملGenerating and Solving Logic Puzzles through Constraint Satisfaction
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle generator for a modification of Sudoku, called Jidoku, in which clues are binary disequalities between cells on a 9× 9 grid. Our generator guarantees that puzzles have unique solutions, have graded difficulty, and can be s...
متن کاملBoolean and Finite Domain Solvers Compared Using Self Referential Quizzes
Currently there appears to be no impartial set of guidelines for choosing an appropriate constraint language for solving a speci c constraint satisfaction problem. A wrong choice can cause disastrous solutions, not only relative to e cient performances, but also with respect to the code clarity of the solution, which can be important for future modi cations. In this paper we make a comparative ...
متن کامل